منابع مشابه
The Minimum Entropy Submodular Set Cover Problem
We study minimum entropy submodular set cover, a variant of the submodular set cover problem (Wolsey [22], Fujito [11], etc) that generalizes the minimum entropy set cover problem (Halperin and Karp [12], Cardinal et al. [5]) We give a general bound of the approximation performance of the greedy algorithm using an approach that can be interpreted in terms of a particular type of biased network ...
متن کاملThe Minimum-Entropy Set Cover Problem
We consider the minimum entropy principle for learning data generated by a random source and observed with random noise. In our setting we have a sequence of observations of objects drawn uniformly at random from a population. Each object in the population belongs to one class. We perform an observation for each object which determines that it belongs to one of a given set of classes. Given the...
متن کاملImproved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem
We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an algorithm combining a greedy approach with another one biased towards large sets. The algorithm is controled by the percentage of elements to which we apply the biased approach. The optimal parameter choice has a phase...
متن کاملInterference in Cellular Networks: The Minimum Membership Set Cover Problem
The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle interference reduction by suitable assignment of transmission power levels to base stations. This task is formalized introducing the Minimum Membership Set Cover combinatorial optimization problem. On the one hand we prove that i...
متن کاملAn Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed. It is possible to install a single tool in every time unit. Once the entire subset Sj has been installed, job j can be processed instantly. The problem is to determine an order of job installations which minimizes th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.09.015